More advanced developers can benefit from the discussions relating to rule task partitioning for efficiency and how rules can be used as part of a hybrid approach, which has broader applicability in other constraint satisfaction problems. 对于级别更高的开发人员,本文将讨论如何为了提高效率而进行规则任务划分,如何使用规则作为混合方法的一部分,以及哪些规则在其他约束满足问题上具有更广泛的适应性。
In particular, I proposed an algorithm for the hybrid approach that you can use to solve constraint satisfaction problems, and applied it to solving Sudoku. 我特意为该混合方法提供了一个算法,您可以用该算法解决约束满足问题,并用它来解决数独。
Solution of Distributed Constraint Satisfaction for Target Area Planning 面向目标区域规划的分布式约束满足求解方法
Constraint satisfaction based resource conflicts detection and resolution in collaborative mission planning 协同任务规划中基于约束满足的资源冲突检测与消解
Distributed constraint satisfaction problem and its application to multi-agent system task allocation 分布式约束满足问题及其在MAS任务分配中的应用
Design models based on dynamic drag are established, and a numerical solution of nonlinear equations under constraint satisfaction is presented. 分析了缓和曲线计算精度,建立了动态拖动模式设计模型,提出了约束满足条件下的非线性方程组的数值解算法。
Hybrid Constraint Satisfaction and Neighborhood Search Algorithm and its Application 约束满足与邻域搜索结合的混合算法及应用
As one of the most important branches of DAI, the distributed constraint satisfaction is in wide application. 分布式约束满足作为分布式人工智能领域的一个重要分支,在许多领域均得到了广泛应用。
Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints. 约束可满足性问题是一大类常出现于现实应用中的复杂问题,因其繁多的约束条件而出名。
This paper proposes a method of adaptive neural network based on constraint satisfaction for Job Shop Scheduling Problem. 提出一种基于约束满足的自适应神经网络方法求解车间作业调度问题。
A constraint satisfaction model is established for steelmaking-continuous casting production scheduling problem with parallel machines in each processing stage. 针对各阶段均有并行机的炼钢&连铸生产调度问题,建立了问题的约束满足模型。
The paper also describes the optimal constraint satisfaction problem in the configuration of the temporary beams, and presents an efficient algorithm. 文中还描述了在临时梁长配置中的最优约束满足问题,并提出了一个高效的算法。
Geometric constraint satisfaction is one of the kernel algorithms in feature based design system. 几何约束求解是基于特征设计系统的核心算法之一。
Based on constraint satisfaction problems model a global scheduling module structure is designed. 采用约束满足问题模型建立全局调度系统模型,设计了全局调度模块结构。
A blind adaptive multiuser detector based on SCS ( Soft Constraint Satisfaction) algorithm is proposed. 提出了一种基于SCS(SoftConstraintSatisfaction)算法的盲自适应多用户检测器。
In general, constraint satisfaction problems are NP-Complete. 一般而言,约束满足问题是NP完全的。
Product Configuration Method Based on Constraint Satisfaction Problem 基于约束满足问题的产品配置方法
A constraint satisfaction scheduling model for the initial scheduling problem and a greedy algorithm for it are given based on the constraints analysis and some basic hypothesis. 在调度约束条件分析和一些基本假设的基础上,本文建立了多卫星初始调度约束模型,并给出了模型求解的贪婪算法。
An effective pruning strategy based on average value constraint satisfaction was proposed, and then a frequent sequential pattern mining algorithm was designed based on the prefix-growth method. 为此,提出了一种基于均值约束满足度剪枝策略,并且以前缀增长方法为基础设计了一个有效的频繁序列模式挖掘算法。
An optimization model based on constraint satisfaction is presented. 给出了一种基于约束满足的高校排课问题模型,提出了高质量排课方案的优化途径。
On Solving Constraint Satisfaction Based Job Shop Scheduling Problems 基于约束满足的Job-Shop调度问题求解方法研究
Research on Discrete Particle Swarm Algorithm for Constraint Satisfaction Problems and Scheduling Problems 约束满足问题与调度问题中离散粒子群算法研究
A Job Shop Scheduling Algorithm Based on Constraint Satisfaction 基于约束满足的Job-Shop调度算法研究
Meanwhile, this approach reduces the dynamic composition of Web services to a constraint satisfaction problem. 该方法把动态WebServices合成转化为约束满足问题。
By comparison with constraint satisfaction networks, this paper presents an essential frame of the logical theory for continuous-state neural networks, and gives the quantitative analyzing method for contradiction. 本文对比约束满足网络,描述了连续状态神经网络的逻辑理论的基本框架,给出了矛盾的定量分析方法。
This paper describes the checking procedure, including EXPRESS model formalization, constraint satisfaction problem ( CSP) derivation from the formalized model and satisfaction checking of the derived CSPs. 文中提到的一致性检查包括三个步骤EXPRESS模型形式化,限制满足性问题(CSP)从形式化模型中的抽取和CSP的可满足性测试。
Constraint propagation is a method for solving constraint satisfaction problem ( CSP). 约束传播算法是求解约束满足问题的一种重要方法。
Based on analyzing constraint conflict, a quantified strategy for solving constraint problem is presented. Quantified degree of constraint satisfaction and conflict are introduced to rank the priority of constraint solving; 通过对约束满足与约束冲突的分析,提出了约束求解的定量化策略基于变量不确定性,量化了约束满足程度与约束冲突程度,解决了约束求解过程中的优先权问题;
Constraint Programming and Constraint satisfaction problem is new research domain in AI developed in last thirty years. 约束编程与约束满足问题是近三十年来在人工智能领域发展起来的一个研究方向。
Geometry constraint solving is the most central technology in the Parameter design methods on the basis of constraint satisfaction. 几何约束求解技术是基于约束满足的参数化设计方法中最核心的技术。